Achievable rates for multiple descriptions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achievable rates for multiple descriptions

Consider a sequence of independent identically distributed where I(.) denotes Shannon mutual information. These rates are shown to be optimal for deterministic distortion measures.

متن کامل

Achievable Rates for Probabilistic Shaping

For a layered probabilistic shaping (PS) scheme with a general decoding metric, an achievable rate is derived using Gallager’s error exponent approach. Several instances for specific decoding metrics are discussed, including bit-metric decoding, interleaved coded modulation, and hard-decision decoding. It is shown that important previously known achievable rates can also be achieved by layered ...

متن کامل

An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes

We consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the l-descriptions problem was the Combinatorial Message Sharing with Binning (CMSB) region. The CMSB scheme utilizes unstructured quantizers and unstructured binnin...

متن کامل

Achievable Rates for Tomlinson-Harashima Precoding

This correspondence examines Tomlinson–Harashima precoding (THP) on discrete-time channels having intersymbol interference and additive white Gaussian noise. An exact expression for the maximum achievable information rate of zero-forcing (ZF) THP is derived as a function of the channel impulse response, the input power constraint, and the additive white Gaussian noise variance. Information rate...

متن کامل

Achievable rates for the Gaussian quantum channel

We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in the phase space of 2N canonical variables. From the existence of symplectically integral lattices with suitable properties, we infer a lower bound on the quan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1982

ISSN: 0018-9448

DOI: 10.1109/tit.1982.1056588